Dynamic weighting in Monte Carlo and optimization
نویسندگان
چکیده
منابع مشابه
Dynamic weighting in Monte Carlo and optimization.
Dynamic importance weighting is proposed as a Monte Carlo method that has the capability to sample relevant parts of the configuration space even in the presence of many steep energy minima. The method relies on an additional dynamic variable (the importance weight) to help the system overcome steep barriers. A non-Metropolis theory is developed for the construction of such weighted samplers. A...
متن کاملDynamic Weighting In Markov Chain Monte Carlo
This article provides a rst theoretical analysis on a new Monte Carlo approach, the dynamic weighting, proposed recently by Wong and Liang. In dynamic weighting, one augments the original state space of interest by a weighting factor, which allows the resulting Markov chain to move more freely and to escape from local modes. It uses a new invari-ance principle to guide the construction of trans...
متن کاملA Theory for Dynamic Weighting in Monte Carlo Computation
This article provides a rst theoretical analysis of a new Monte Carlo approach, the dynamic weighting algorithm, proposed recently by Wong and Liang. In dynamic weighting Monte Carlo, one augments the original state space of interest by a weighting factor, which allows the resulting Markov chain to move more freely and to escape from local modes. It uses a new invariance principle to guide th...
متن کاملthe effect of monte carlo, molecular dynamic and langevin dynamic
insulin-like growth factor (igf-1) is an anti-apoptosis factor in multiple cell types associated with various cancers. computational methods allow investigating the systems between 50–100 atoms in the frame of quantum mechanics and up to 50,000 atoms with molecular dynamics. since there are specific interactions between the residues, the solvent could play an important role in the stability of ...
متن کاملImproving population Monte Carlo: Alternative weighting and resampling schemes
Population Monte Carlo (PMC) sampling methods are powerful tools for approximating distributions of static unknowns given a set of observations. These methods are iterative in nature: at each step they generate samples from a proposal distribution and assign them weights according to the importance sampling principle. Critical issues in applying PMC methods are the choice of the generating func...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 1997
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.94.26.14220